Topology and the optical Dirac equation
نویسندگان
چکیده
منابع مشابه
Spinors and the Dirac Equation
The Dirac equation can be derived using the relativistic relation between mass and energy E = m (normalized units) and the symmetries of the universe, so it is necessary to have a firm grasp on the latter. The relativistic symmetry group is the orthochronous Poincare group SO(1, 3) n R, though we shall mainly use just the orthochronous Lorentz group SO(1, 3). Its Lie algebra is so(1, 3). We fir...
متن کاملThe Modified Dirac Equation
We consider the behavior of particles at ultra relativistic energies, for both the Klein-Gordon and Dirac equations. We observe that the usual description is valid for energies such that we are outside the particle’s Compton wavelength. For higher energies however, both the Klein-Gordon and Dirac equations get modified and this leads to some new effects for the particles, including the appearan...
متن کاملThe Lorentz - Dirac equation
The Lorentz-Dirac equation (LDE) x 000 ? x 00 = d dx V (x) models the point limit of the Maxwell-Lorentz equation describing the interaction of a charged extended particle with the electromagnetic eld. Since (LDE) admits solutions which accelerate even if they are outside the zone of interaction, Dirac proposed to study so-called "non runaway" solutions satisfying the condition x 00 (t) ! 0 as ...
متن کاملDecoherence in the Dirac Equation
A Dirac particle is represented by a unitarily evolving state vector in a Hilbert space which factors as Hspin Hposition. Motivated by the similarity to simple models of decoherence consisting of a two state system coupled to an environment, we investigate the occurence of decoherence in the Dirac equation upon tracing over position. We conclude that the physics of this mathematically exact mod...
متن کاملSpatial search and the Dirac equation
Quantum mechanical computers can solve certain problems asymptotically faster than classical computers. One of the major advantages of quantum computation comes from a fast algorithm for the problem of finding a marked item among N items. Whereas a classical computer requires Θ(N) steps to solve this problem, Grover showed that a quantum computer can solve it using only O( √ N) steps [1], which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2018
ISSN: 2469-9926,2469-9934
DOI: 10.1103/physreva.98.043837